Performance Bounds for Scheduling Queueing Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounds and error bounds for queueing networks

Queueing networks are an important means to model and evaluate a variety of practical systems. Unfortunately, analytic results are often not available. Numerical computation may then have to be employed. Or, system modifications might be suggested to obtain simple bounds or computationally easy approximations. Formal analytic support for the accuaracy or nature of such modifications or approxim...

متن کامل

Performance Bounds and Differential Cost Approximations for Queueing Networks

A new bound is proposed relating the average cost sub-optimality of a myopic policy to its differential cost error. The bound is an expectation over the stationary distribution for this policy. For small queueing networks, we compute or approximate the distribution using the matrix analytic method and numerically test the bound. Product form approximations to the stationary distribution are als...

متن کامل

Performance bounds for feedforward queueing networks with upper-constrained inputs

We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a customer follows in the network depends on the flow to which he belongs. The amount of traffic fed by a customer flow into the network is bounded by a deterministic subadditive function, which is called a subadditive envelope...

متن کامل

Robust Scheduling for Queueing Networks

Robust Scheduling for Queueing Networks

متن کامل

Scheduling Queueing Networks: Stability, Performance Analysis, and Design

policies to reduce mean and variance of cycle{time in semiconductor manufacturing plants. IEEE Transactions on Semiconductor Manufacturing, 7(3):374{385, 1994. [33] K. G. Murty. Linear Programming. John Wiley and Sons, New York, NY, 1983. [34] K. G. Murty and S. N. Kabadi. Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming, 39:117{129, 1987. [35] J. Ou an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Applied Probability

سال: 1992

ISSN: 1050-5164

DOI: 10.1214/aoap/1177005711